Lossless Image Compression Using Data Folding Followed By Arithmetic Coding
نویسندگان
چکیده
The paper presents a lossless image compression technique using the hybridization of two different entropy coding techniques. Initially data folding technique has been applied to the image. A row folding is applied on the image matrix followed by a column folding. Multiple iterations of this process is applied on the image. After completing the data folding process another entropy coding technique known as arithmetic coding has been applied to the resultant image to get better results.
منابع مشابه
Image Compression Using Blocksort
ICT has been exploring the application of the limited-order blocksort [1MS] to lossy and lossless image compression. The method used to predict values is similar to Binary Tree Predictive Coding (BTPC) [2JR]. In BTPC, the quantized prediction errors are encoded using static Huffman coding. The ICT coder establishes a sorting order based on each pixel's context and applies the limited-order bloc...
متن کاملA Two-Stage Scheme for Lossless Compression of Images
A two-stage lossless image compression scheme is presented , the rst stage of which decorrelates the raw image data by using a two-dimensional, causal linear predic-tor, resulting in signiicant entropy reduction. The second stage uses standard coding techniques. Diierent two-stage schemes are compared with respect to their performances on several images, using bilevel coding, arithmetic coding,...
متن کاملState of the Art Lossless Image Compression Algorithms
There are numerous applications of image processing, such as satellite imaging, medical imaging, and video where the image size or image stream size is too large and requires a large amount of storage space or high bandwidth for communication in its original form. Image compression techniques can be used e ectively in such applications. Lossless (reversible) image compression techniques preserv...
متن کاملLossless image compression using binary wavelet transform
A binary wavelet transform (BWT) has several distinct advantages over a real wavelet transform when applied to binary data. No quantisation distortion is introduced and the transform is completely invertible. Since all the operations involved are modulo-2 arithmetic, it is extremely fast. The outstanding qualities of the BWT make it suitable for binary image-processing applications. The BWT, or...
متن کاملA Neural Network for Context-based Arithmetic Coding in Lossless Image Compression
Significant progress has recently been made in lossless image compression using discrete wavelet transforms. The overall performance of these schemes may be further improved by properly designing efficient entropy coders. In this paper a new technique is introduced for the implementation of context-based adaptive arithmetic entropy coding. This technique is based on the prediction of the value ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015